Computation with finite fields
نویسندگان
چکیده
منابع مشابه
Efficient Computation of Roots in Finite Fields
We present an algorithm to compute r-th roots in Fqm with complexity O((logm + r log q)m log q) for certain choices of m and q. This compares well to previously known algorithms, which need O(rm log q) steps.
متن کاملComplexity of computation in Finite Fields
Efficient implementation of arithmetic in finite fields is of primary importance for cryptography, coding theory, digital signal processing etc. (see, for example [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]). In this survey we consider only Boolean circuits for arithmetic operations in finite fields. Another term: bit-parallel circuits. Boolean circuits for multiplication and inversion in finite fields are...
متن کاملOn the computation of discrete logarithms in finite prime fields
In this thesis we write about practical experience when solving congruences of the form a ≡ b mod p, a, b, p, x ∈ ZZ, p prime. This is referred to as the discrete logarithm problem in (ZZ/pZZ)∗. Many cryptographic protocols such as signature schemes, message encryption, key exchange and identification depend on the difficulty of this problem. We are concerned with the practicability of differen...
متن کاملFast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves
We propose a randomized algorithm to compute isomorphisms between finite fields using elliptic curves. To compute an isomorphism between two degree n extensions of the finite field with q elements, our algorithm takes Õ ( n log q +max l (ll log q + l log q) ) time, where l runs through primes dividing n but not q(q − 1) and nl denotes the highest power of l dividing n. Prior to this work, the b...
متن کاملconstruction of vector fields with positive lyapunov exponents
in this thesis our aim is to construct vector field in r3 for which the corresponding one-dimensional maps have certain discontinuities. two kinds of vector fields are considered, the first the lorenz vector field, and the second originally introced here. the latter have chaotic behavior and motivate a class of one-parameter families of maps which have positive lyapunov exponents for an open in...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1963
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(63)90129-3